On large-scale generalized inverses in solving two-by-two block linear systems

On Solving Linear Diophantine Systems Using Generalized Rosser's Algorithm

Parallel two level block ILU preconditioning techniques for solving large sparse linear systems

We discuss issues related to domain decomposition and multilevel preconditioning techniques which are often employed for solving large sparse linear systems in parallel computations. We introduce a class of parallel preconditioning techniques for general sparse linear systems based on a two level block ILU factorization strategy. We give some new data structures and strategies to construct loca...

Solving Large Scale Linear SVM with Distributed Block Minimization

Over recent years we have seen the appearance of huge datasets that do not fit into memory and do not even fit on the hard disk of a single computer. Moreover, even when processed on a cluster of machines, data are usually stored in a distributed way. The transfer of significant subsets of such datasets from one node to another is very slow. We present a new algorithm for training linear Suppor...

A New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation

In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...

Two algorithms for solving comrade linear systems

In this paper, we present an efficient computational and symbolic algorithms for solving comrade linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA, and MATLAB is straightforward. An examples are given in order to illustrate the algorithms. 2006 Elsevier Inc. All rights reserved.